package leetcode;

public class _0238 {
    /**
     * 除自身以外数组的乘积
     */
    class Solution {
        public int[] productExceptSelf(int[] nums) {
            int n =nums.length;
            int[] L = new int[n];
            int[] R = new int[n];
            int[] ans =new int[n];
            L[0]=1;
            for(int i=1;i<n;i++){
                L[i]=L[i-1]*nums[i-1];
            }
            R[n-1]=1;
            for(int i=n-2;i>=0;i--){
                R[i] = R[i+1]*nums[i+1];
            }
            for(int i=0;i<n;i++){
                ans[i] = L[i]*R[i];
            }
            return ans;
        }
    }
}
